Lexical Distributivity and Implicit Arguments
نویسندگان
چکیده
منابع مشابه
Context dependence and implicit arguments in existentials∗
This paper discusses the semantics of bare existentials, i.e. existentials in which nothing follows the post copular NP (e.g. There are four sections). While it has sometimes been recognized that the interpretation of such sentences depends in some way on context, the exact nature of the context dependence involved has not been properly understood. It is shown that the meaning of bare existenti...
متن کاملImplicit Evaluation of “auto” Variables and Arguments
Many people would expect C to be of type matrix as well. Whether C is a matrix depends on the implementation of operator∗. In the case that the operator returns a matrix then C is a matrix. For the sake of performance, computationally expensive operators very often return an Expression Template and delay the evaluation to a later point in time when it can be performed more efficiently—because w...
متن کاملThe Distribution and Comprehension of Implicit Arguments
A core question in linguistics is how expressions are built from functions and their arguments, e.g. verbs and nouns. Generally all of a function’s arguments must be pronounced. Certain arguments may remain implicit (i.e., unpronounced), but only as long as they are recoverable from prior discourse. This project investigates how this recovery procedure is similar to that of determining the ante...
متن کاملCoping With Implicit Arguments And Events Coreference
In this paper we present ongoing work for the creation of a linguistically-based system for event coreference. We assume that this task requires deep understanding of text and that statistically-based methods, both supervised and unsupervised are inadequate. The reason for this choice is due to the fact that event coreference can only take place whenever argumenthood is properly computed. It is...
متن کاملImplicit and noncomputational arguments using monads
We provide a monadic view on implicit and noncomputational arguments. This allows us to treat Berger’s non-computational quantifiers in the Coq-system. We use Tait’s normalization proof and the concatenation of vectors as case studies for the extraction of programs. With little effort one can eliminate noncomputational arguments from extracted programs. One thus obtains extracted code that is n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semantics and Linguistic Theory
سال: 1993
ISSN: 2163-5951
DOI: 10.3765/salt.v3i0.2751